Finding sets of acceptable solutions with a genetic algorithm with application to surface wave group dispersion in Europe
نویسنده
چکیده
We discuss the use of a genetic algorithm (GA) to invert data for many acceptable solutions, in contrast to inversion for a single, "optimum" solution. The GA is a directed search method which does not need linearization of the forward problem or a starting model, and it can be applied with a very large mode!-space. Consequently, fewer assumptions are required and a greater ange of solutions is examined than with many other inversion methods. We apply the GA to fundamental Rayleigh group dispersion estimates for paths across Central Europe and across the East European Platform to determine "average", layered S velocity models separately for each region. The use of the GA allows an identical model parameterization and broad parameter search range to be used for both regions. The scatter of acceptable solutions hows velocity-depth trade-offs around the Moho, indicates the depth resolution of the inversion, and shows the uncertainty in upper mantle, S velocity estimates. The results indicate that a thicker crust and up to 0.3 km/sec (7%) higher S wave velocities in the upper 100 km of the mantle under the older East European Platform than under Central Europe explain most of the differences in the data sets.
منابع مشابه
Dispersion of Torsional Surface Wave in a Pre-Stressed Heterogeneous Layer Sandwiched Between Anisotropic Porous Half-Spaces Under Gravity
The study of surface waves in a layered media has their viable application in geophysical prospecting. This paper presents an analytical study on the dispersion of torsional surface wave in a pre-stressed heterogeneous layer sandwiched between a pre-stressed anisotropic porous semi-infinite medium and gravitating anisotropic porous half-space. The non-homogeneity within the intermediate layer a...
متن کاملA full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem
This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کامل